Capricorn: An Algorithm for Subtropical Matrix Factorization Sanjar Karaev∗ Abstract Max-times algebra, sometimes known as subtropical algebra, is a semi-ring over the nonnegative real numbers where the addition operat

Source URL: people.mpi-inf.mpg.de

• Matrix theory
• Linear algebra
• Numerical linear algebra
• Multivariate statistics
• Non-negative matrix factorization
• Matrix
• Singular value decomposition
• Rank
• Block matrix
• Low-rank approximation

c 2012 Society for Industrial and Applied Mathematics  SIAM J. OPTIM. Vol. 22, No. 4, pp. 1549–1578

Source URL: stanford.edu

• Generalized functions
• Stochastic optimization
• Mathematical optimization
• Ergodic theory
• Mixing
• Stochastic approximation
• Markov chain
• Distribution
• Subgradient method
• Central limit theorem

A Quadratically Convergent Algorithm for Structured Low-Rank Approximation ´ Eric Schost1 and Pierre-Jean Spaenlehauer2 1

Source URL: www.csd.uwo.ca

• Numerical linear algebra
• Linear algebra
• Matrix theory
• Functional analysis
• Matrices
• Low-rank approximation
• Singular value decomposition
• Matrix
• MoorePenrose pseudoinverse
• Kernel
• Projection
• Linear map

218CHAPTER 8. GENERALIZATION AND FUNCTION APPROXIMATION Initialize θ! arbitrarily Repeat (for each episode): !e = !0 s, a ← initial state and action of episode

Source URL: webdocs.cs.ualberta.ca

September 18, :5 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Source URL: www.math.vt.edu

• Quantum mechanics
• Quantum chemistry
• Differential equations
• Approximations
• Mathematical physics
• BornOppenheimer approximation
• Partial differential equation
• Wave
• Perturbation theory
• LandauZener formula
• WKB approximation
• Diabatic

1 Tensor Completion for Estimating Missing Values in Visual Data Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye Abstract—In this paper we propose an algorithm to estimate missing values in tensors of visual

Source URL: peterwonka.net

• Linear algebra
• Matrix theory
• Tensors
• Mathematical optimization
• Numerical linear algebra
• Matrix completion
• Tensor rank decomposition
• Low-rank approximation
• Singular value decomposition
• Matrix
• Tensor
• Semidefinite programming

Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Approximation algorithms
• Complexity classes
• Operations research
• NP-complete problems
• Polynomial-time approximation scheme
• Travelling salesman problem
• Steiner tree problem
• APX
• Optimization problem
• Combinatorial optimization
• NP

Online Algorithms Susanne Albers Stefano Leonardiy Over the past twelve years, online algorithms have received considerable research interest. Online

Source URL: www14.in.tum.de

• Online algorithms
• Analysis of algorithms
• Theoretical computer science
• Metrical task system
• K-server problem
• Adversary model
• Algorithm
• Competitive analysis
• Randomized algorithm
• Approximation algorithm
• Computational learning theory

Diatomic Molecules with Large Angular Momentum in the Born–Oppenheimer Approximation Sharon M. Hughes†∗ and George A. Hagedorn† Department of Mathematics and

Source URL: www.math.vt.edu

• Quantum chemistry
• Molecular physics
• Computability theory
• operator
• ALGOL 68
• Operator
• R0
• Molecular Hamiltonian
• BornOppenheimer approximation

Data Mining and Knowledge Discovery manuscript No. (will be inserted by the editor) Fast approximation of betweenness centrality through sampling Matteo Riondato ·

Source URL: matteo.rionda.to

• Network theory
• Graph theory
• Centrality
• Betweenness centrality
• Distance
• Shortest path problem
• Connected component
• GirvanNewman algorithm
• Wiener connector